Pii: S0140-3664(99)00059-6
نویسندگان
چکیده
In this work we suggest algorithms that increase the reservation success probability for bursty traffic in high speed networks by adding flexibility to the construction of the routes. These algorithms are simple enough to be implemented by cheap hardware. They cause no additional delay to packets that use the original route, and a very small delay to the packets that are rerouted. In addition, the presented algorithms have a minimal communication overhead, due to the local nature of their work. Two high-speed network models are considered: source routing and ATM. q 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Bandwidth reservation for bursty traffic in the presence of resource availability uncertainty
In this work we suggest algorithms that increase the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the routes. These algorithms are simple enough to be implemented by cheap hardware. They cause no additional delay to packets that use the original route, and a very small delay to the packets that are rerouted. In addition, the ...
متن کاملPii: S0140-3664(99)00196-6
We propose a simple distance-vector protocol for routing in networks having unidirectional links. The protocol can be seen as an adaptation for these networks of the strategy as used in the popular RIP protocol. The protocol comprises two main algorithms, one for collecting “from” information, and the other one for generating and propagating “to” information. Like the RIP protocol, this one can...
متن کاملAdvanced service architecture for H.323 Internet Protocol Telephony
........................................................................................................................ I Acknowledgement ...................................................................................................... II Table of
متن کامل